An algorithm for computing powers of a Hessenberg matrix and its applications
نویسندگان
چکیده
منابع مشابه
AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولComputing the Hessenberg matrix associated with a self-similar measure
We introduce in this paper a method to calcúlate the Hessenberg matrix of a sum of measures from the Hessenberg matrices of the component measures. Our method extends the spectral techniques used by G. Mantica to calcúlate the Jacobi matrix associated with a sum of measures from the Jacobi matrices of each of the measures. We apply this method to approximate the Hessenberg matrix associated wit...
متن کاملImplementing an Algorithm for Solving Block Hessenberg Systems Implementing an Algorithm for Solving Block Hessenberg Systems
This paper describes the implementation of a recursive descent method for solving block Hessenberg systems. Although the algorithm is conceptually simple, its implementation in C (a natural choice of language given the recursive nature of the algorithm and its data) is nontrivial. Particularly important is the balance between ease of use, computational eeciency, and exibility. This report and t...
متن کاملAn Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
We describe an efficient procedure for implementing the Hessenberg QR algorithm on a class of matrices that we refer to as subunitary matrices. This class includes the set of Szegő-Hessenberg matrices, whose characteristic polynomials are Szegő polynomials, i.e., polynomials orthogonal with respect to a measure on the unit circle in the complex plane. Computing the zeros of Szegő polynomials is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1976
ISSN: 0024-3795
DOI: 10.1016/0024-3795(76)90072-0